Strong Stationary Times and the Fundamental Matrix for Recurrent Markov Chains
نویسندگان
چکیده
منابع مشابه
Strong Stationary Times for Non-Uniform Markov Chains
This thesis studies several approaches to bounding the total variation distance of a Markov chain, focusing primarily on the strong stationary time approach. While strong stationary times have been used successfully with uniform walks on groups, non-uniform walks have proven harder to analyze. This project applied strong stationary techniques to simple non-uniform walks in the hope of finding s...
متن کاملStopped Markov chains with stationary occupation times
Let E be a nite set equipped with a group G of bijective transformations and suppose that X is an irreducible Markov chain on E that is equivariant under the action of G. In particular, if E = G with the corresponding transformations being left or right multiplication, then X is a random walk on G. We show that when X is started at a xed point there is a stopping time U such that the distributi...
متن کاملSpeed of convergence to stationarity for Markov chains: Strong Stationary Times, stochastic monotonicity
In first part we will discuss one of the methods in more details: Strong Stationary Time. It gives probabilistic approach to bounding the rate of convergence for Markov chains. It was introduced by D. Aldous and P. Diaconis in [1]. We will review some known examples (for example: random walk on Zn, top-to-random shuffling cards) and use it to show that 2n log n + cn steps are enough to be “near...
متن کاملStrong stationary duality for Möbius monotone Markov chains
For Markov chains with a finite, partially ordered state space, we show strong stationary duality under the condition of Möbius monotonicity of the chain. We give examples of dual chains in this context which have no downwards transitions. We illustrate general theory by an analysis of nonsymmetric random walks on the cube with an interpretation for unreliable networks of queues.
متن کاملOn hitting times and fastest strong stationary times for skip-free and more general chains
An (upward) skip-free Markov chain with the set of nonnegative integers as state space is a chain for which upward jumps may be only of unit size; there is no restriction on downward jumps. In a 1987 paper, Brown and Shao determined, for an irreducible continuous-time skip-free chain and any d, the passage time distribution from state 0 to state d. When the nonzero eigenvalues νj of the generat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Stochastic Analysis
سال: 2016
ISSN: 0973-9599
DOI: 10.31390/cosa.10.4.07